The strong decidability of cut-logics. I. Partial propositional calculi.
نویسندگان
چکیده
منابع مشابه
Approximating Propositional Calculi by Finite-Valued Logics
Bernays introduced a method for proving underivability results in propositional calculi C by truth tables. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that the best candidate matrices for (1) can be computed from the calculus, and how sequences for (2) can be found for certain classes of logics. Furthermore, ...
متن کاملOn Decidability and Expressiveness of Propositional Interval Neighborhood Logics
Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues for Propositional Neighborhood Logics (PNLs). We begin by comparing the expressiveness of the different PNLs. Then, we focus on the most expressive one, namely, PNL, and we show that it is decidable over various classe...
متن کاملMetric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entities and truth of formulae is defined relative to time intervals, rather than time instants. In this paper, we introduce and study Metric Propositional Neighborhood Logic (MPNL) over natural numbers. MPNL features two modalities r...
متن کاملPropositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions
In this paper, we investigate the expressiveness of the variety of propositional interval neighborhood logics (PNL), we establish their decidability on linearly ordered domains and some important sub-classes, and we prove undecidability of a number of extensions of PNL with additional modalities over interval relations. All together, we show that PNL form a quite expressive and nearly maximal d...
متن کاملAlmost Duplication-Free Tableau Calculi for Propositional Lax Logics
In this paper we provide tableau calculi for the intuitionistic modal logics PLL and PLL 1 , where the calculus for PLL 1 is duplication{free while among the rules for PLL there is just one rule that allows duplication of formulas. These logics have been investigated by Fairtlough and Mendler in relation to the problem of Formal Hardware Veriication. In order to develop these calculi we extend ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1971
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093894295